On Proofs About Threshold Circuits and Counting Hierarchies (Extended Abstract)
نویسندگان
چکیده
We define theories of Bounded Arithmetic characterizing classes of functions computable by constantdepth threshold circuits of polynomial and quasipolynomial size. Then we define certain second-order theories and show that they characterize the functions in the Counting Hierarchy. Finally we show that the former theories are isomorphic to the latter via the socalled RSUV -isomorphism.
منابع مشابه
On Proofs about Threshold Circuits and Counting Hierarchies
We deene theories of Bounded Arithmetic characterizing classes of functions computable by constant-depth threshold circuits of polynomial and quasipoly-nomial size. Then we deene certain second-order theories and show that they characterize the functions in the Counting Hierarchy. Finally we show that the former theories are isomorphic to the latter via the so-called RSUV-isomorphism.
متن کاملThe Differential Calculus of Bitstreams ( extended
CWI's research has a theme-oriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms. The Differential Calculus of Bitstreams (extended abstract) ABSTRACT Using (stream) differential equations for definitions and coinduction for proofs, we define, analyse, and relate in a uniform way four different algebraic structures on ...
متن کاملSwitched-Capacitor Dynamic Threshold PMOS (SC-DTPMOS) Transistor for High Speed Sub-threshold Applications
This work studies the effects of dynamic threshold design techniques on the speed and power of digital circuits. A new dynamic threshold transistor structure has been proposed to improve performances of digital circuits. The proposed switched-capacitor dynamic threshold PMOS (SC-DTPMOS) scheme employs a capacitor along with an NMOS switch in order to effectively reduce the threshold voltage of ...
متن کاملApplication of modified balanced iterative reducing and clustering using hierarchies algorithm in parceling of brain performance using fMRI data
Introduction: Clustering of human brain is a very useful tool for diagnosis, treatment, and tracking of brain tumors. There are several methods in this category in order to do this. In this study, modified balanced iterative reducing and clustering using hierarchies (m-BIRCH) was introduced for brain activation clustering. This algorithm has an appropriate speed and good scalability in dealing ...
متن کاملOn P-selectivity and Closeness
P/poly, the class of sets with polynomial size circuits, has been the subject of considerable study in complexity theory. Two important subclasses of P/poly are the class of sparse sets 6] and the class of P-selective sets 31]. A large number of results have been proved about both these classes but it has been observed (for example, 17]) that despite their similarity, proofs about one class gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003